Analysis of a near-metric TSP approximation algorithm
نویسندگان
چکیده
منابع مشابه
Approximation Taxonomy of Metric TSP
The list below presents the best up to now known upper and lower approximation bounds for the instances of metric TSP (we refer also to another source on approximation algorithms for metric TSP [8]). It is intended to codify (at one glance) the (many) recent developments and improvements on the approximability of that problem. It is hoped to be useful in further research on the possible improve...
متن کاملA near-optimal approximation algorithm for Asymmetric TSP
5 We present a near-optimal polynomial-time approximation algorithm for the asymmetric 6 traveling salesman problem for graphs of bounded orientable or non-orientable genus. Our al7 gorithm achieves an approximation factor of O(f(g)) on graphs with genus g, where f(n) is the 8 best approximation factor achievable in polynomial time on arbitrary n-vertex graphs. In par9 ticular, the O(log n/ log...
متن کاملImproved Approximation Algorithms for Metric Max TSP
We present two polynomial-time approximation algorithms for the metric case of the maximum traveling salesman problem. One of them is for directed graphs and its approximation ratio is 27 35 . The other is for undirected graphs and its approximation ratio is 78−o(1). Both algorithms improve on the previous bests.
متن کاملDeterministic 7/8-Approximation for the Metric Maximum TSP
We present the first 7/8-approximation algorithm for the maximum traveling salesman prob-lem with triangle inequality. Our algorithm is deterministic. This improves over both the random-ized algorithm of Hassin and Rubinstein [3] with expected approximation ratio of 7/8−O(n)and the deterministic (7/8 −O(n))-approximation algorithm of Chen and Nagoya [1].In the new algorithm, we ...
متن کاملA -approximation algorithm for Graphic TSP in cubic bipartite graphs
We prove new results for approximating Graphic TSP. Specifically, we provide a polynomialtime 9 7 -approximation algorithm for cubic bipartite graphs and a ( 9 7 + 1 21(k−2) )-approximation algorithm for k-regular bipartite graphs, both of which are improved approximation factors compared to previous results. Our approach involves finding a cycle cover with relatively few cycles, which we are a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: RAIRO - Theoretical Informatics and Applications
سال: 2013
ISSN: 0988-3754,1290-385X
DOI: 10.1051/ita/2013040